Software Crowdsourcing Task Allocation Algorithm Based on Dynamic Utility
نویسندگان
چکیده
منابع مشابه
Dynamic Task Allocation for Crowdsourcing Settings
We consider the problem of optimal budget allocation for crowdsourcing problems, allocating users to tasks to maximize our final confidence in the crowdsourced answers. Such an optimized worker assignment method allows us to “boost” the efficacy of any popular crowdsourcing estimation algorithm. We consider a mutual information interpretation of the crowdsourcing problem, which leads to a stoch...
متن کاملAn Insect-Based Algorithm for the Dynamic Task Allocation Problem
An insect-based algorithm inspired by the division of labor in insect colonies is proposed and applied to the solution of an online scheduling problem. A painting facility is considered for illustrating the problem: Trucks leave an assembly line to get painted in painting booths. The goal is to minimize the makespan, that is, the time needed for painting all given trucks. In this paper we addre...
متن کاملMulti Agent Based Dynamic Task Allocation
Multi-Agent system, which is relatively a recent term, can be viewed as a sub-field of Distributed AI. In order to construct and solve complex real world problems like task allocation in an organization, a number of agents can perform work cooperatively and collaboratively. To achieve the maximum system utility through the proper task allocation among agents, there is a notion of dynamic team f...
متن کاملMulti-robot Task Allocation Based on Ant Colony Algorithm
With the development of information technology, the capability and application fields of robots become wider. In order to complete a complex task, the cooperation and coordination of robots are needed to be adopted. As the main problem of the multi-robot systems, multi-robot task allocation (MRTA) reflects the organization form and operation mechanism of the robots system. The cooperation and a...
متن کاملAuction Based Mechanisms for Dynamic Task Assignments in Expert Crowdsourcing
Crowdsourcing marketplaces link large populations of workers to an even larger number of tasks. Thus, it is necessary to have mechanisms for matching workers with interesting and suitable tasks. Earlier work has addressed the problem of finding optimal workers for a given set of tasks. However, workers also have preferences and will stay with a platform only if it gives them interesting tasks. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2902913